Malware Clustering Using Family Dependency Graph
نویسندگان
چکیده
منابع مشابه
Partitional Clustering of Malware Using K-Means
This paper describes a novel method aiming to cluster datasets containing malware behavioural data. Our method transform the data into an standardised data matrix that can be used in any clustering algorithm, finds the number of clusters in the data set and includes an optional visualization step for high-dimensional data using principal component analysis. Our clustering method deals well with...
متن کاملScreening smartphone applications using malware family signatures
The sharp increase in smartphone malware has become one of the most serious security problems. Since the Android platform has taken the dominant position in smartphone popularity, the number of Android malware has grown correspondingly and represents critical threat to the smartphone users. This rise in malware is primarily attributable to the occurrence of variants of existing malware. A set o...
متن کاملSource Code to Module Dependency Graph Using Class Dependency Analyzer
-In this demonstration we will show how our tool source code analysis, can be used to recover the highlevel structure of a software system directly from its source code. We accomplish this task by first using a source code analysis system (e.g., CIA, Acacia) to produce a module dependency graph that represents system modules and module-level inter-relationships. Keywords---source code, software...
متن کاملClusTheDroid: Clustering Android Malware
The volume of new Android malware is growing at an exponential pace. This cries for automated tools that can aid the malware analyst in dissecting the behaviours of new malicious applications. In this paper, we present ClusTheDroid, a system for clustering Android malware so as to identify malicious applications that exhibit similar behaviours. For this, ClusTheDroid extracts feature sets from ...
متن کاملStatistical Dialogue Management using Intention Dependency Graph
We present a method of statistical dialogue management using a directed intention dependency graph (IDG) in a partially observable Markov decision process (POMDP) framework. The transition probabilities in this model involve information derived from a hierarchical graph of intentions. In this way, we combine the deterministic graph structure of a conventional rule-based system with a statistica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2914031